Communication in Private-Information Models: Theory, Computation, and an Application
نویسنده
چکیده
Communication and no-communication versions of a two-stage principal-agent model are compared. The models contain a risk-averse agent and two sources of private information, a shock to preferences followed by a productive action. Both models are formulated as linear programs, which are then used to compute solutions to examples. In simple cases, a sufficient condition for communication to be valuable is derived. In these cases, communication improves risk-sharing in bad states of the world. In more complicated cases, computed examples demonstrate how communication may also alter labor supply. Further examples demonstrate how action and consumption lotteries may separate agents by their shock. Survey evidence and Þeld work on contractual arrangements between farmers and landowners in an Indian village is used to motivate the class of models. Suggestive evidence on communication from the same sources is also described.
منابع مشابه
A multi agent method for cell formation with uncertain situation, based on information theory
This paper assumes the cell formation problem as a distributed decision network. It proposes an approach based on application and extension of information theory concepts, in order to analyze informational complexity in an agent- based system, due to interdependence between agents. Based on this approach, new quantitative concepts and definitions are proposed in order to measure the amount of t...
متن کاملApplication of Stochastic Optimal Control, Game Theory and Information Fusion for Cyber Defense Modelling
The present paper addresses an effective cyber defense model by applying information fusion based game theoretical approaches. In the present paper, we are trying to improve previous models by applying stochastic optimal control and robust optimization techniques. Jump processes are applied to model different and complex situations in cyber games. Applying jump processes we propose some m...
متن کاملAn Introduction to Differential Computation Analysis (DCA) on the withe-box cryptography algorithms
Advances in information and communication technologies lead to use of some new devices such as smart phones. The new devices provide more advantages for the adversaries hence with respect to them, one can define with-box cryptography. In this new model of cryptography, designers try to hide the key using as a kind of implementation. The Differential Computation Analysis (DCA) is a side channel ...
متن کاملOn the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational complexity of the function being computed? For instance, can computationally unbounded players compute an arbitrary function of their inputs with polynomial communication complexity and a linear threshold of unconditiona...
متن کاملA new method for accelerating impossible differential cryptanalysis and its application on LBlock
Impossible differential cryptanalysis, the extension of differential cryptanalysis, is one of the most efficient attacks against block ciphers. This cryptanalysis method has been applied to most of the block ciphers and has shown significant results. Using structures, key schedule considerations, early abort, and pre-computation are some common methods to reduce complexities of this attack. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001